Meta Typing Is Compatible to the Typed Spo Approach

Meta-typing, as for example employed in the Progres environment , is syntactic sugar making the speciication of typed graph grammar systems more convenient. This paper presents an approach of meta-typing that ts in the well-elaborated framework of the typed single pushout (spo) approach to graph transformation. In a rst step the node meta-typing system of Progres is generalized such that edges may be subject to meta-typing, too. In a second step it is shown how any meta-typed graph grammar can be transformed into an equivalent ordinary typed spo graph grammar. The main result of this contribution is that the presented concept of meta-typing is compatible to the spo theory and can be implemented, therefore, into the spo-based graph grammar engineering environment Agg without spoiling its formally sound basis. As a more practical result it can be claimed that the well-known application gap between Progres and Agg will certainly become smaller in the immediate future.